Divergence coding for convolutional codes
نویسندگان
چکیده
منابع مشابه
Chapter 3 Coding Theorems for Convolutional Accumulate - m Codes
It is well-known that long random codes achieve reliable communication at noise levels up to the Shannon limit, but they provide no structure for efficient decoding. The introduction and analysis of Repeat Accumulate (RA) codes by Divsalar, Jin, and McEliece [10] shows that the concatenation of a repetition code and a rate-1 code, through a random interleaver, can also achieve reliable communic...
متن کاملNew convolutional codes from old convolutional codes
In this paper, starting with a family of convolutional codes, we construct a new convolutional code and we introduce also necessary and sufficient conditions in order that the new convolutional code is MDS.
متن کاملChannel Coding Techniques with Emphasis on Convolutional and Turbo Codes
In this thesis, a family of low complexity convolutional codes is constructed, by modifying appropriately the trellis diagram of punctured convolutional codes. The goal is to improve performance at the expense of a reasonable low increase of the trellis complexity. Many new convolutional codes of various code rates and values of complexity are provided. In many cases, a small increase in comple...
متن کاملConvolutional Codes
The difference between block codes and convolutional codes is the encoding principle. In the block codes, the information bits are followed by the parity bits. In convolutional codes the information bits are spread along the sequence. That means that the convolutional codes map information to code bits not block wise, but sequentially convolve the sequence of information bits according to some ...
متن کاملconvolutional cylinder-type block-circulant cycle codes
in this paper, we consider a class of column-weight two quasi-cyclic low-density paritycheck codes in which the girth can be large enough, as an arbitrary multiple of 8. then we devote a convolutional form to these codes, such that their generator matrix can be obtained by elementary row and column operations on the parity-check matrix. finally, we show that the free distance of the convolution...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: MATEC Web of Conferences
سال: 2017
ISSN: 2261-236X
DOI: 10.1051/matecconf/201712505009